Performance guided scheduling in GENIE through ICENI
نویسندگان
چکیده
Initial work in the Grid ENabled Integrated Earth system model (GENIE) project involved a series of parameter sweep experiments using a Grid infrastructure consisting of a flocked Condor pool, a web service oriented data management system and a web portal. In this paper we introduce the Imperial College E-Science Networked Infrastructure (ICENI) Grid middleware, and describe how it can be used to increase the efficiency of GENIE parameter sweep experiments. We perform several experiments using a combination of different computational resources and different job deployment mechanisms. Our results suggest that ICENI does not produce any significant overhead in the sojourn time of a GENIE parameter sweep experiment and can promote the sharing of computational resources between institutions.
منابع مشابه
Using ICENI to run parameter sweep applications across multiple Grid resources
The Imperial College e-Science Networked Infrastructure (ICENI) provides an end-to-end Grid middleware to facilitate Grid administrators, developers and end-users. It consists of both a service oriented Grid framework and an application toolkit, using a component programming model to represent Grid applications. In this paper we give an overview of ICENI from an application user’s point of view...
متن کاملICENI II Architecture
The Imperial College e-Science Networked Infrastructure (ICENI) has been developed by the London e-Science Centre for over four years. ICENI has prototyped many novel ideas for providing an end to end Grid middleware. This has included: Service-Oriented Architecture, component programming model, retaining and using metadata collected throughout the life-cycle of an application, and scheduling a...
متن کاملICENI Dataflow and Workflow: Composition and Scheduling in Space and Time
With the prevalence of component based and service oriented architectures used to support e-Science activities, we examine different views of application composition supported within these systems, which tend to be spatial composition in the former case, and temporal composition (workflow) in the latter. We consider the advantages of each view; spatial composition enables, dynamic programming, ...
متن کاملScheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کامل